Antisuit Injunctions and Preclusion against Absent Nonresident Class Members

Matching preclusion and Conditional Matching preclusion for Crossed Cubes

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those inci...

Absent Uvula: What Mallampati Class?

1. Roman SJ, Chong Sit DA, Boureau CM, Auclin FX, Ullern MM. Sub‐Tenon’s anaesthesia: An efficient and safe technique. Br J Ophthalmol 1997;81:673‐6. 2. Kumar CM, Dodds C. Sub‐Tenon’s anesthesia. Ophthalmol Clin North Am 2006;19:209‐19. 3. Kumar CM, Eid H, Dodds C. Sub‐Tenon’s anaesthesia: Complications and their prevention. Eye (Lond) 2011;25:694‐703. 4. Allman KG, Theron AD, Byles DB. A new t...

Anticompetitive Patent Injunctions

Strong matching preclusion

The matching preclusion problem, introduced by Brigham et al. [Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185-192], studies how to effectively make a graph have neither perfect matchings nor almost perfect matchings by deleting as small a number of edges as possible. Extending this concept, we consider a more general matching preclusion problem, called the strong matching pr...

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those indu...